Structure and folding of theTetrahymenatelomerase RNA pseudoknot
نویسندگان
چکیده
منابع مشابه
Structure and folding of the Tetrahymena telomerase RNA pseudoknot
Telomerase maintains telomere length at the ends of linear chromosomes using an integral telomerase RNA (TER) and telomerase reverse transcriptase (TERT). An essential part of TER is the template/pseudoknot domain (t/PK) which includes the template, for adding telomeric repeats, template boundary element (TBE), and pseudoknot, enclosed in a circle by stem 1. The Tetrahymena telomerase holoenzym...
متن کاملPredicting RNA pseudoknot folding thermodynamics
Based on the experimentally determined atomic coordinates for RNA helices and the self-avoiding walks of the P (phosphate) and C4 (carbon) atoms in the diamond lattice for the polynucleotide loop conformations, we derive a set of conformational entropy parameters for RNA pseudoknots. Based on the entropy parameters, we develop a folding thermodynamics model that enables us to compute the sequen...
متن کاملFolding 3-Noncrossing RNA Pseudoknot Structures
In this article, we present the novel ab initio folding algorithm cross, which generates minimum free energy (mfe), 3-noncrossing, canonical RNA structures. Here an RNA structure is 3-noncrossing if it does not contain three or more mutually crossing arcs and canonical, if each of its stacks has size greater or equal than two. Our notion of mfe-structure is based on a specific concept of pseudo...
متن کاملThe computer simulation of RNA folding involving pseudoknot formation.
The algorithm and the program for the prediction of RNA secondary structure with pseudoknot formation have been proposed. The algorithm simulates stepwise folding by generating random structures using Monte Carlo method, followed by the selection of helices to final structure on the basis of both their probabilities of occurrence in a random structure and free energy parameters. The program ver...
متن کاملAn RNA Pseudoknot Folding Algorithm Based on Heuristic Searching
The general problem for the prediction of RNA secondary structure with pseudoknots is NP-hard. For a restricted class of pseudoknots, it was traditionally solved by the dynamic programming approach. However, these algorithms are computationally very expensive, when the input sequence or the contained pseudoknot is too long. We present a heuristic algorithm for RNA secondary structures with pseu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nucleic Acids Research
سال: 2016
ISSN: 0305-1048,1362-4962
DOI: 10.1093/nar/gkw1153